Assigning Multiple Job Types to Parallel Specialized Servers

نویسنده

  • Dinard van der Laan
چکیده

In this paper methods of mixing decision rules are investigated and applied to the so-called multiple job type assignment problem with specialized servers which is modeled as continuous time Markov decision process. Performance optimization is difficult for this assignment problem, but optimization over the class of static policies is tractable. By applying the described mixing methods a suitable static decision rule is mixed with some dynamic decision rules which are easy to describe and implement. For the discussed mixing methods optimization is performed over corresponding classes of so-called mixing policies. These mixing policies are still easy to describe and implement and for all investigated instances the optimized mixing policies perform substantially better than optimal static policies. Moreover, the optimized mixing policies perform better than stationary dynamic policies which apply at decision epochs one of the dynamic rules to which the mixing methods have been applied.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A CSA Method for Assigning Client to Servers in Online Social Networks

This paper deals with the problem of user-server assignment in online social network systems. Online social network applications such as Facebook, Twitter, or Instagram are built on an infrastructure of servers that enables them to communicate with each other. A key factor that determines the facility of communication between the users and the servers is the Expected Transmission Time (ETT). A ...

متن کامل

Job Replication on Multiserver Systems

Parallel processing is a way to use resources efficiently by processing several jobs simultaneously on different servers. In a well-controlled environment where the status of the servers and the jobs are well known, everything is nearly deterministic and replicating jobs on different servers is obviously a waste of resources. However, in a poorly controlled environment where the servers are unr...

متن کامل

Optimal static distribution of prioritized customers to heterogeneous parallel servers

-The main aim of this paper is to present a model for distributing prioritized customers to heterogeneous parallel servers. A queuing optimization model is proposed in the form of a nonlinear programming problem having linear constraints, so that the average mean response time taken over all job requests is minimized. A solution procedure is developed by employing the convexity of the performan...

متن کامل

Assigning Tasks for Efficiency in Hadoop

In recent years Google’s MapReduce has emerged as a leading large-scale data processing architecture. Adopted by companies such as Amazon, Facebook, Google, IBM and Yahoo! in daily use, and more recently put in use by several universities, it allows parallel processing of huge volumes of data over cluster of machines. Hadoop is a free Java implementation of MapReduce. In Hadoop, files are split...

متن کامل

Decentralized Probabilistic Job Dispatching in Heterogeneous Multiple Computer Systems

In this paper, we study decentralized probabilistic job dispatching and load balancing strategies which optimize the performance of heterogeneous multiple computer systems. We present a model to study a heterogeneous multiple computer system with a decentralized stochastic job dispatching mechanism, where nodes are treated as M/G/1 servers. We discuss a way to implement a virtual centralized jo...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015